Many-one reductions and the category of multivalued functions
نویسندگان
چکیده
منابع مشابه
Many-one reductions and the category of multivalued functions
Many-one reductions between search problems (i.e. multi-valued functions) play a crucial part in both algorithmic game theory (via classes such as PLS or PPAD) and the study of incomputability in analysis. While the formal setting differs significantly, the present papers offers a unifying approach in terms of category theory that allows to deduce that any degree structure arising from such red...
متن کاملCalreticulin: one protein, one gene, many functions.
The endoplasmic reticulum (ER) plays a critical role in the synthesis and chaperoning of membrane-associated and secreted proteins. The membrane is also an important site of Ca(2+) storage and release. Calreticulin is a unique ER luminal resident protein. The protein affects many cellular functions, both in the ER lumen and outside of the ER environment. In the ER lumen, calreticulin performs t...
متن کاملFractalkine: one chemokine, many functions.
purification quality of CLP is important, especially for analyses of T-cell development. The original phenotypic CLP has recently been refined by addition of positivity for Flk25 and now a smaller population of cells including CD27 are shown to contain the T-cell potential. A specific criticism of the CLP as the thymus-seeding cell has been the lack of evidence that CLP can be detected in thymu...
متن کاملThe Many Entropies in One-Way Functions
Computational analogues of information-theoretic notions have given rise to some of the most interesting phenomena in the theory of computation. For example, computational indistinguishability, Goldwasser and Micali [9], which is the computational analogue of statistical distance, enabled the bypassing of Shanon’s impossibility results on perfectly secure encryption, and provided the basis for ...
متن کاملPolynomial-time Many-one Reductions for Petri Nets
We apply to Petri net theory the technique of polynomial-time many-one reductions. We study boundedness, reachability, deadlock , liveness problems and some of their variations. We derive three main results. Firstly, we highlight the power of expression of reachability which can polynomially give evidence of unboundedness. Secondly, we prove that reachability and deadlock are polynomially-time ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2015
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129515000262